Shortest Path Computations in S-Graphs
نویسندگان
چکیده
We consider a class of non-planar graphs that arises in VLSI layout compaction and show that a number of shortest path problems on these graphs can be solved in the same time as the corresponding problem in a planar graph.
منابع مشابه
Shortest Path Computations in Source-Deplanarized Graphs
We consider a class of non-planar graphs that arises in VLSI layout compaction and show that a numuer of shortest path problems on these graphs can be solved in the same time as the corresponding problem in a planar graph.
متن کاملDrawing Graphs to Speed Up Shortest-Path Computations
We consider the problem of (repeatedly) computing singlesource single-target shortest paths in large, sparse graphs. Previous investigations have shown the practical usefulness of geometric speed-up techniques that guarantee the correctness of the result for shortest-path computations. However, such speed-up techniques utilize a layout of the graph which typically comes from geographic informat...
متن کاملSome Optimal Parallel Algorithms on Interval and Circular-arc Graphs
In this paper, we consider some shortest path related problems on interval and circular-arc graphs. For the all-pair shortest path query problem on interval and circular-arc graphs, instead of using the sophisticated technique, we propose simple parallel algorithms using only the parallel prefix and suffix computations and the Euler tour technique. Our preprocessing algorithms run in O(log n) t...
متن کاملAcceleration of Shortest Path and Constrained Shortest Path Computation
We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries. We focus on two methods based on Dijkstra’s algorithm for sh...
متن کاملSome Optimal Parallel Algorithms for Shortest Path Related Problems on Interval and Circular-arc Graphs
In this paper, we consider some shortest path related problems on interval and circular-arc graphs. For the all-pair shortest path query problem on interval and circular-arc graphs, instead of using the sophisticated technique, we propose simple parallel algorithms using only the parallel prefix and suffix computations and the Euler tour technique. Our preprocessing algorithms run in O(log n) t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013